Flow control using the theory of zero sum Markov games
نویسندگان
چکیده
منابع مشابه
Flow Control Using the Theory of Zero Sum Markov Games
We consider the problem of dynamic ow control of arriving packets into an innnite buuer. The service rate may depend on the state of the system, may change in time and is unknown to the controller. The goal of the controller is to design an eecient policy which guarantees the best performance under the worst service conditions. The cost is composed of a holding cost, a cost for rejecting custom...
متن کاملDecision Theory III - Zero Sum Games
Game theory is a huge area of mathematical (and economical) research. We restrict ourselves mainly to two person zero-sum games, in which you make a decision and your opponent makes a decision (no cooperation allowed!), and your winnings equal your opponents loss. The main result is the so-called minimax theorem. Essentially, game theory is about playing against a (possibly) better player and e...
متن کاملSampling Techniques for Zero-sum, Discounted Markov Games
In this paper, we first present a key approximation result for zero-sum, discounted Markov games, providing bounds on the state-wise loss and the loss in the sup norm resulting from using approximate Q-functions. Then we extend the policy rollout technique for MDPs to Markov games. Using our key approximation result, we prove that, under certain conditions, the rollout technique gives rise to a...
متن کاملApproximate Dynamic Programming for Two-Player Zero-Sum Markov Games
This paper provides an analysis of error propagation in Approximate Dynamic Programming applied to zero-sum two-player Stochastic Games. We provide a novel and unified error propagation analysis in Lp-norm of three well-known algorithms adapted to Stochastic Games (namely Approximate Value Iteration, Approximate Policy Iteration and Approximate Generalized Policy Iteratio,n). We show that we ca...
متن کاملValue Function Approximation in Zero-Sum Markov Games
This paper investigates value function approximation in the context of zero-sum Markov games, which can be viewed as a generalization of the Markov decision process (MDP) framework to the two-agent case. We generalize error bounds from MDPs to Markov games and describe generalizations of reinforcement learning algorithms to Markov games. We present a generalization of the optimal stopping probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1994
ISSN: 0018-9286
DOI: 10.1109/9.286259